A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands

In today’s world, logistics problems are crucial for the supply chain management. The vehicle routing one of most studied combinatorial optimization in literature. real life applications, all parameters problem may not be known. this paper, we considered capacitated with stochastic demands. Uniform and normal distributions were analyzed on customer demands to observe nature problem. These methods compared by using GAMS different test which taken from clustering analysis including K-means algorithm also applied large-sized problems. All obtained results presented detail.